Defining and Implementing Commutativity Conditions for Parallel Execution

data type: an algebraic methodology for their specification. In MFDBS 89: Proceedings of the second symposium on Mathematical fundamentals of database systems, pages 53–67, New York, NY,USA, 1989. Springer-Verlag New York, Inc. [3] Brian D. Carlstrom, Austen McDonald, Hassan Chafi, JaeWoongChung, Chi Cao Minh, Christos Kozyrakis, and Kunle Olukotun. The atomos transactional programming language. SIGPLAN Not.,41(6):1–13, 2006. [4] Brian D. Carlstrom, Austen McDonald, Christos Kozyrakis, andKunle Olukotun. Transactional collection classes. In Principles and Practices of Parallel Programming (PPoPP), 2007. [5] Thomas Cormen, Charles Leiserson, Ronald Rivest, and CliffordStein, editors. Introduction to Algorithms. MIT Press, 2001. [6] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger. The notionsof consistency and predicate locks in a database system. Commun. ACM, 19(11):624–633, 1976. [7] Jim Gray and Andreas Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann Publishers Inc., San Francisco, CA,USA, 1992. [8] Lance Hammond, Vicky Wong, Mike Chen, Brian D. Carlstrom,John D. Davis, Ben Hertzberg, Manohar K. Prabhu, Honggo Wijaya,Christos Kozyrakis, and Kunle Olukotun. Transactional memorycoherence and consistency. ISCA, 00:102, 2004. [9] Maurice Herlihy and Eric Koskinen. Transactional boosting:a methodology for highly-concurrent transactional objects. In PPoPP ’08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, 2008. [10] Maurice Herlihy, Victor Luchangco, Mark Moir, and William N. Scherer, III. Software transactional memory for dynamic-sized datastructures. In PODC ’03: Proceedings of the twenty-second annualsymposium on Principles of distributed computing, 2003. [11] Maurice P. Herlihy and Jeannette M. Wing. Linearizability: acorrectness condition for concurrent objects. ACM Transactionson Programming Languages and Systems (TOPLAS), 12(3):463–492,1990. [12] Venkata Krishnan and Josep Torrellas. A chip-multiprocessorarchitecture with speculative multithreading. IEEE Trans. Comput.,48(9):866–880, 1999. [13] Milind Kulkarni, Martin Burtscher, Rajeshkar Inkulu, Keshav Pingali,and Calin Casçaval. How much parallelism is there in irregular applications? In PPoPP ’09: Proceedings of the 14th ACM SIGPLANsymposium on Principles and practice of parallel programming,2009. [14] Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, BruceWalter, Kavita Bala, and L. Paul Chew. Optimistic parallelismbenefits from data partitioning. SIGARCH Comput. Archit. News(Proceedings of ASPLOS 2008), 36(1):233–243, 2008. [15] Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Rama-narayanan, Kavita Bala, and L. Paul Chew. Optimistic parallelismrequires abstractions. SIGPLAN Not. (Proceedings of PLDI 2007),42(6):211–222, 2007. [16] Kevin E. Moore, Jayaram Bobba, Michelle J. Moravan, Mark D.Hill, and David A. Wood. Logtm: Log-based transactional memory.In HPCA ’06: Proceedings of the 12th International Symposium onHigh Performance Computer Architecture, 2006. [17] Yang Ni, Vijay Menon, Ali-Reza Adl-Tabatabai, Antony L. Hosking,Rick Hudson, J. Eliot B. Moss, Bratin Saha, and Tatiana Shpeisman.Open nesting in software transactional memory. In Principles andPractices of Parallel Programming (PPoPP), 2007. [18] Christos H. Papadimitriou. The serializability of concurrent databaseupdates. J. ACM, 26(4):631–653, 1979. [19] Lawrence Rauchwerger and David A. Padua. The LRPD test:Speculative run-time parallelization of loops with privatization and reduction parallelization. IEEE Trans. Parallel Distrib. Syst.,10(2):160–180, 1999. [20] Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hudson, Chi CaoMinh, and Benjamin Hertzberg. McRT-STM: a high performance software transactional memory system for a multi-core runtime. In PPoPP ’06: Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 187–197, New York, NY, USA, 2006. ACM Press. [21] Hanan Samet. Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2005. [22] Peter M. Schwarz and Alfred Z. Spector. Synchronizing sharedabstract types. ACM Trans. Comput. Syst., 2(3):223–250, 1984. [23] Bruce Walter, Kavita Bala, Milind Kulkarni, and Keshav Pingali. Fastagglomerative clustering for rendering. In Interactive Ray Tracing, 2008. RT 2008. IEEE Symposium on, pages 81–86, Aug. 2008. [24] W.E. Weihl. Commutativity-based concurrency control for abstractdata types. IEEE Transactions on Computers, 37(12), 1988.